An Overview of the Theory of Relaxed Unification
نویسندگان
چکیده
We give an overview of the Theory of Relaxed Unification—a novel theory that extends the classical Theory of Unification. Classical unification requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can contain inconsistent information. Classical unification fails when the data is imperfect. We propose the Theory of Relaxed Unification as a new theory that relaxes the constraints of classical unification without requiring special preprocessing of data. Relaxed unification tolerates possible errors and inconsistencies in the data and facilitate reasoning under uncertainty. The Theory of Relaxed Unification is more general and has higher efficacy than the classical Theory of Unification. We present the fundamental concepts of relaxed unification, a relaxed unification algorithm, a number of examples.
منابع مشابه
Pacific Association for Computational Linguistics EXPRESSING PROBABILISTIC CONTEXT-FREE GRAMMARS IN THE RELAXED UNIFICATION FORMALISM
The Theory of Relaxed Unification is a newly proposed theory that extends the power of classical unification. The theory relaxes the rigid constraints of requiring a perfect match between the terms being unified to allow multi-valued attributes. The Relaxed Unification Inference System is an implementation of an inference engine and an interpreter, which uses the relaxed unification mechanism i...
متن کاملTowards the Theory of Relaxed Unification
Classical unification is strict in the sense that it requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can contain inconsistent information. Classical unification fails when the data is imperfect. Fuzzy unification partially addresses uncertainty but requires the creation of fuzzy databases. We propose the Theory of Relaxed Unification as a...
متن کاملRational Choice Theory: An Overview
It seems easy to accept that rationality involves many features that cannot be summarized in terms of some straightforward formula, such as binary consistency. However, this recognition does not immediately lead to alternative characterizations that might be regarded as satisfactory, even though the inadequacies of the traditional assumptions of rational behavior standard used in economic theo...
متن کاملInjectivity in a category: an overview on smallness conditions
Some of the so called smallness conditions in algebra as well as in category theory, are important and interesting for their own and also tightly related to injectivity, are essential boundedness, cogenerating set, and residual smallness. In this overview paper, we first try to refresh these smallness condition by giving the detailed proofs of the results mainly by Bernhard Banaschewski and W...
متن کاملRobust Chart Parsing with Mildly Inconsistent Feature Structures
We introduce the formal underpinnings of our theory of non-classical feature structures. The resulting expanded universe of feature structures has direct impfications for robust parsing for linguistic theories founded upon feature theory. We present an implementation of a robust chart parser for Head-driven Phrase Structure Grammar (HPSG). The problem of relaxed unification is in limiting it so...
متن کامل